Coupled task scheduling with time-dependent processing times

The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks, and there is an exact delay between the tasks. We investigate objective minimizing makespan under identical processing time for first period all time-dependent setting second task. Certain healthcare appointment problems can be modeled as problem. Also, incorporation lets human resource fatigue deteriorating health conditions modeled. provide optimal solution certain conditions. In addition, we propose dynamic program condition that majority jobs share same characteristic. develop heuristic general case show performs well.